Constant-factor approximation in sub-exponential time for the tollbooth problem on trees
ثبت نشده
چکیده
In the tollbooth problem on a tree, we are given a tree T , m customers, each given by a terminal pair si, ti and a budget bi ∈ R+, i = 1, . . . ,m. The objective of the problem is to set non-negative prices to the edges of T in order to maximize the profit obtained by selling the edges to the customers who can afford to buy their path. We give a constant factor approximation algorithm for the problem that runs in quasi-polynomial time.
منابع مشابه
A Path-Decomposition Theorem with Applications to Pricing and Covering on Trees
In this paper we focus on problems characterized by an input n-node tree and a collection of subpaths. Motivated by the fact that some of these problems admit a very good approximation (or even a poly-time exact algorithm) when the input tree is a path, we develop a decomposition theorem of trees into paths. Our decomposition allows us to partition the input problem into a collection of O(log l...
متن کاملProfit-maximizing pricing for tollbooths
The input to the tollbooth problem is a graph G = (V,E) and a set of m buyers Pi where each buyer is interested in buying a path Pi connecting si, ti ∈ V . Each buyer comes with a budget b(Pi), a positive real number. The problem is to set non-negative prices to the edges E of G. A buyer buys her path Pi if the sum of prices on Pi is at most her budget. If a buyer buys her path, we obtain a pro...
متن کاملA Note on a Connection Between Small Set Expansions and Modularity Clustering
In this note, we explore a connection between two seemingly different problems from two different domains: the small-set expansion problem studied in unique games conjecture, and a popular community finding approach for social networks known as the modularity clustering approach. We show that a sub-exponential time algorithm for the small-set expansion problem leads to a sub-exponential time co...
متن کاملApproximation Algorithms for the Max-coloring Problem
Given a graph G = (V,E) and positive integral vertex weights w : V → N, the max-coloring problem seeks to find a proper vertex coloring of G whose color classes C1, C2, . . . , Ck, minimize ∑k i=1 maxv∈Ciw(v). The problem arises in scheduling conflicting jobs in batches and in minimizing buffer size in dedicated memory managers. In this paper we present three approximation algorithms and one in...
متن کاملImproved Approximations for the k-Hotlink Assignment Problem and for Binary Searching in Trees
We present a study on two optimization problems in trees: the kHotlink Assignment Problem and the problem of Binary Searching in Trees. For the first problem we prove the existence of an FPTAS when k = 1, improving upon the constant factor algorithm recently obtained in [Jacobs, WADS 2007]. In addition, we develop the first constant factor approximation algorithm for arbitrary k. For the second...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010